Computational Complexities of University Interview Timetabling
نویسندگان
چکیده
منابع مشابه
Computational Complexities of University Interview Timetabling
This paper introduces a new timetabling problem on universities, called interview timetabling. In this problem, some constant number, say three, of referees are assigned to each of 2n graduate students. Our task is to construct a presentation timetable of these 2n students using n timeslots and two rooms, so that two students evaluated by the same referee must be assigned to different timeslots...
متن کاملComputational Complexity Issues in University Interview Timetabling
In the Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, there are approximately 20 professors, and 40 graduate course students in each year. In the final year of the course, every student submits a research thesis, and presents his/her work in twenty minutes to obtain a master degree. Presentation meeting is scheduled for two days, and in gene...
متن کاملUniversity Timetabling
University timetabling problems can be classified into two main categories: course and examination timetabling. We discuss the problem statements and constraints for each of them and provide an overview of some recent research advances that have been made by the authors and members of their research team. We particularly concentrate upon: • Meta-heuristic approaches that are less dependent upon...
متن کاملUniversity Timetabling in ECLPS
This paper describes how the university timetabling problem is addressed in the Laurea course Ingegneria dell’Informazione (Information Engineering) for the University of Ferrara, Italy. The university timetabling problem is modelled as a Constraint Optimisation Problem and addressed with ECLPS, one of the leading Constraint Logic Programming languages.
متن کاملMetaheuristics for university course timetabling
The work presented in this thesis concerns the problem of timetabling at universities – particularly course-timetabling, and examines the various ways in which metaheuristic techniques might be applied to these sorts of problems. Using a popular benchmark version of a university course timetabling problem, we examine the implications of using a “twostaged” algorithmic approach, whereby in stage...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.130